1. |
- Sander, Ingo, et al.
(författare)
-
High-Level Estimation and Trade-Off Analysis for Adaptive Real-Time Systems
- 2009
-
Ingår i: 2009 IEEE INTERNATIONAL SYMPOSIUM ON PARALLEL & DISTRIBUTED PROCESSING. - 9781424437511 ; , s. 2985-2988
-
Konferensbidrag (refereegranskat)abstract
- We propose a novel design estimation method for adaptive streaming applications to be implemented on a partially reconfigurable FPGA. Based on experimental results we enable accurate design cost estimates at an early design stage. Given the size and computation time of a set of configurations, which can be derived through logic synthesis, our method gives estimates for configuration parameters, such as bitstream sizes, computation mid reconfiguration times. To fulfil the system's throughput requirements, the required FIFO buffer sizes are then calculated using a hybrid analysis approach based on integer linear programming and simulation. Finally, we are able to calculate the total design cost as the sum of the costs for the FPGA area, the required configuration memory and the FIFO buffers. We demonstrate our method by analysing non-obvious trade-offs for a static and dynamic implementation of adaptivity.
|
|
2. |
- Zhu, Jun, et al.
(författare)
-
Buffer Minimization of Real-Time Streaming Applications Scheduling on Hybrid CPU/FPGA Architectures
- 2009
-
Ingår i: DATE. - 9781424437818 ; , s. 1506-1511
-
Konferensbidrag (refereegranskat)abstract
- We address the problem of real-time streaming applications scheduling on hybrid CPU/FPGA architectures. The main contribution is a two-step approach to minimize the buffer requirement for streaming applications with throughput guarantees. A novel declarative way of constraint based scheduling for real-time hybrid SW/HW systems is proposed, while the application throughput is guaranteed by periodic phases in execution. We use a voice-band modem application to exemplify the scheduling capabilities of our method. The experimental results show the advantages of our techniques in both less buffer requirement and higher throughput guarantees compared to the traditional PAPS method.
|
|
3. |
- Zhu, Jun, 1976-
(författare)
-
Energy and Design Cost Efficiency for Streaming Applications on Systems-on-Chip
- 2009
-
Licentiatavhandling (övrigt vetenskapligt/konstnärligt)abstract
- With the increasing capacity of today's integrated circuits, a number ofheterogeneous system-on-chip (SoC) architectures in embedded systemshave been proposed. In order to achieve energy and design cost efficientstreaming applications on these systems, new design space explorationframeworks and performance analysis approaches are required. Thisthesis considers three state-of-the-art SoCs architectures, i.e., themulti-processor SoCs (MPSoCs) with network-on-chip (NoC) communication,the hybrid CPU/FPGA architectures, and the run-time reconfigurable (RTR)FPGAs. The main topic of the author?s research is to model and capturethe application scheduling, architecture customization, and bufferdimensioning problems, according to the real-time requirement. Sincethese problems are NP-complete, heuristic algorithms and constraintprogramming solver are used to compute a solution.For NoC communication based MPSoCs, an approach to optimize thereal-time streaming applications with customized processorvoltage-frequency levels and memory sizes is presented. A multi-clockedsynchronous model of computation (MoC) framework is proposed inheterogeneous timing analysis and energy estimation. Using heuristicsearching (i.e., greedy and taboo search), the experiments show anenergy reduction (up to 21%) without any loss in application throughputcompared with an ad-hoc approach.On hybrid CPU/FPGA architectures, the buffer minimization scheduling ofreal-time streaming applications is addressed. Based on event models,the problem has been formalized decoratively as constraint basescheduling, and solved by public domain constraint solver Gecode.Compared with traditional PAPS method, the proposed method needssignificantly smaller buffers (2.4% of PAPS in the best case), whilehigh throughput guarantees can still be achieved.Furthermore, a novel compile-time analysis approach based on iterativetiming phases is proposed for run-time reconfigurations in adaptivereal-time streaming applications on RTR FPGAs. Finally, thereconfigurations analysis and design trade-offs analysis capabilities ofthe proposed framework have been exemplified with experiments on bothexample and industrial applications.
|
|
4. |
- Zhu, Jun, et al.
(författare)
-
Energy efficient streaming applications with guaranteed throughput on MPSoCs
- 2008
-
Ingår i: Proceedings of the 7th ACM International Conference on Embedded Software, EMSOFT 2008. - New York, NY, USA : ACM. - 9781605584683 ; , s. 119-128
-
Konferensbidrag (refereegranskat)abstract
- In this paper we present a design space exploration flow to achieve energy efficiency for streaming applications on MPSoCs while meeting the specified throughput constraints. The public domain simulators Sim-Panalyzer and Cacti are used to estimate the energy dissipations of the parameterized architectural components. As the main contributions, we schedule the streaming applications on a multi-clock synchronous modeling framework, guarantee the application timing properties by throughput analysis, and customize both processor voltage-frequency levels and memory sizes in the design space to optimize the application pipeline parallelism for energy efficiency. Two widely used heuristic algorithms (i.e., greedy and taboo search) are used during the design optimization process. Our experiments show an energy reduction of 21% without any loss in application throughput compared with an ad-hoc approach.
|
|
5. |
- Zhu, Jun, et al.
(författare)
-
Performance Analysis of Reconfiguration in Adaptive Real-Time Streaming Applications
- 2008
-
Ingår i: PROCEEDINGS OF THE 2008 IEEE/ACM/IFIP WORKSHOP ON EMBEDDED SYSTEMS FOR REAL-TIME MULTIMEDIA. - 9781424426126 ; , s. 53-58
-
Konferensbidrag (refereegranskat)abstract
- We propose a design optimization framework for adaptive real-time streaming applications. The main contribution is a hybrid approach for performance analysis combining formal analysis and simulation using a two-phase framework. We formulate the scheduling problem of adaptive streaming applications with ILP analysis, and use the simulation based on the synchronous model of computation to ensure throughput guarantees. We finally illustrate the capabilities of our methodology by experiments.
|
|
6. |
- Zhu, Jun, et al.
(författare)
-
SDF to Synchronous Cross Domain Analysis in ForSyDe Stream Processing Framework
- 2006
-
Konferensbidrag (refereegranskat)abstract
- Stream processing has been a very active field in parallel programming for its suitability to expressthe concurrent architecture in embedded systems. Caused by its concurrent reasoning features,stream programming frameworks are built on some abstract models of computation (MoCs) tohandle the complexity and unpredictability. To allow us focus on the essential issues of time,communication and synchronisation of the parallel tasks, the support from a sound heterogeneousMoCs framework to stream application system is still in need. ForSyDe is our high levelexecutable design framework to express multi-computational-models, based on stream processingconcept. It is a heterogeneous diagram to describe intricate application behaviors, and offers crossdomain analysis features to support multi-domains integration and optimization. A case study inForSyDe framework shows that the communication structure of a stream application in SDFdomain could be migrated to the synchronous domain without any extra work on its computationfunctions. To integrate it with our work on a communication based NoC simulator, we believesome more interesting design exploration work could be done on the analysis of communicationand computation efforts, besides power issues.
|
|